On the choice of the stochastic comparison method for multidimensional Markov chains analysis
نویسندگان
چکیده
The ≼Φ stochastic comparison (≼Φ∈ {≼st, ≼wk, ≼wk∗}) of multidimensional Continuous Time Markov Chains (CTMC)s is an efficient but a complex method for the performability evaluation of computer systems. Different techniques can be applied for the stochastic comparison of Markov chains. The coupling is an intuitive method, and may be applied by comparing the evolution of sample paths due to events to establish the ≼st ordering. The increasing set method is based on the comparison of transition rates for a family of increasing sets. It is a more general formalism as it can be applied for all of these orderings : ≼st, ≼wk, and ≼wk∗ . The goal of this paper is to identify the relationships between these orderings, in order to determine the method to apply for establishing comparisons between models. Altough the ≼st ordering between random variables implies ≼wk and ≼wk∗ orderings, this result could not be generalized to the comparison of stochastic processes. However even the ≼st ordering does not exist between processes, the ≼wk and the ≼wk∗ constraints could be satisfied. In this paper, we aim to give the intuition to choose the most suitable method with respect to the underlying performability study.
منابع مشابه
Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملENTROPY FOR DTMC SIS EPIDEMIC MODEL
In this paper at rst, a history of mathematical models is given.Next, some basic information about random variables, stochastic processesand Markov chains is introduced. As follows, the entropy for a discrete timeMarkov process is mentioned. After that, the entropy for SIS stochastic modelsis computed, and it is proved that an epidemic will be disappeared after a longtime.
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملJoint Bayesian Stochastic Inversion of Well Logs and Seismic Data for Volumetric Uncertainty Analysis
Here in, an application of a new seismic inversion algorithm in one of Iran’s oilfields is described. Stochastic (geostatistical) seismic inversion, as a complementary method to deterministic inversion, is perceived as contribution combination of geostatistics and seismic inversion algorithm. This method integrates information from different data sources with different scales, as prior informat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011